Compatible Euler tours for transition systems in Eulerian graphs
نویسندگان
چکیده
منابع مشابه
Multi-Eulerian Tours of Directed Graphs
Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least once, and uses edges e and f the same number of times whenever tail(e) = tail(f). This definition leads to a simple generalization of the BEST Theorem. We then show that the minimal length of a multi-Eulerian tour is b...
متن کاملExact counting of Euler tours for generalized series-parallel graphs
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized series-parallel graph. Note that the class of generalized seriesparallel graphs includes all outerplanar graphs. We can perform the counting in time O(m∆), where ...
متن کاملExact counting of Euler Tours for Graphs of Bounded Treewidth
In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs are known to be ♯P complete for general graphs (Brightwell and Winkler, 2005 [4]). To date, no polynomial-time algorithm for counting Euler tours of any class of graphs is known except for the very special case of seri...
متن کاملCounting Euler Tours in Undirected Bounded Treewidth Graphs
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel by proving a GapL ⊆ NC ⊆ P upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs. Our main technical contribution is to show how (an instance of) dynamic programming on bounded clique-width graphs can be performed efficiently in parallel. Thus we show...
متن کاملTopological Circles and Euler Tours in Locally Finite Graphs
We obtain three results concerning the topological cycle space C of a locally finite connected graph G. Confirming a conjecture of Diestel we show that through every edge set E ∈ C there is a topological Euler tour, a continuous map from the circle S to the end compactification |G| of G that traverses every edge in E exactly once and traverses no other edge. Second, we show that for every seque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90125-7